Classic-Like Cut-Based Tableau Systems for Finite-Valued Logics
نویسندگان
چکیده
A general procedure is presented for producing classic-like cut-based tableau systems for finite-valued logics. In such systems, cut is the only branching rule, and formulas are accompanied by signs acting as syntactic proxies for the two classical truth-values. The systems produced are guaranteed to be sound, complete and analytic, and they are also seen to polinomially simulate the truth-table method, thus extending the results in [6]. Lukasiewicz’s 3-valued logic is used throughout as a simple illustrative example.
منابع مشابه
Bivalent semantics, generalized compositionality and analytic classic-like tableaux for finite-valued logics
The paper is a contribution both to the theoretical foundations and to the actual construction of efficient automatizable proof procedures for non-classical logics. We focus here on the case of finite-valued logics, and exhibit: (i) a mechanism for producing a classic-like description of them in terms of an effective variety of bivalent semantics; (ii) a mechanism for extracting, from the bival...
متن کاملClassic-Like Analytic Tableaux for Finite-Valued Logics
The paper provides a recipe for adequately representing a very inclusive class of finite-valued logics by way of tableaux. The only requisite for applying the method is that the object logic received as input should be sufficiently expressive, in having the appropriate linguistic resources that allow for a bivalent representation. For each logic, the tableau system obtained as output has some a...
متن کاملTowards an Efficient Tableau Proof Procedure for Multiple-Valued Logics
One of the obstacles against the use of tableau-based theorem provers for non-standard logics is the ineeciency of tableau systems in practical applications, though they are highly intuitive and extremely exible from a proof theoretical point of view. We present a method for increasing the eeciency of tableau systems in the case of multiple-valued logics by introducing a generalized notion of s...
متن کاملDyadic semantics for many-valued logics
This paper obtains an effective method which assigns two-valued semantics to every finite-valued truth-functional logic (in the direction of the so-called “Suszko’s Thesis”), provided that its truth-values can be individualized by means of its linguistic resources. Such two-valued semantics permit us to obtain new tableau proof systems for a wide class of finitevalued logics, including the main...
متن کاملSequent-like Tableau Systems with the Analytic Superformula Property for the Modal Logics
We give complete sequent-like tableau systems for the modal logics KB , KDB , K5, and KD5. Analytic cut rules are used to obtain the completeness. The systems have the analytic superformula property and can thus give a decision procedure.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012